package com.xxd.algo.leetcode.base;

/**
 * @author: XiaoDong.Xie
 * @create: 2020-07-03 17:18
 * @description:
 */
public class Question160_GetIntersectionNode {


    public class Node {
        int val;
        Node next;

        Node(int x) {
            val = x;
            next = null;
        }
    }

    public Node getIntersectionNode(Node headA, Node headB) {
        if (headA == null || headB == null) {
            return null;
        }

        
        return null;
    }

}
